Boolean satisfiability problem

Results: 324



#Item
21Boolean algebra / Logic in computer science / Boolean satisfiability problem / Electronic design automation / SAT / Human intelligence

EMERGENCE OF INTELLIGENT MACHINES: CHALLENGES AND OPPORTUNITIES Non-Human Intelligence Bart Selman

Add to Reading List

Source URL: intelligence.org

Language: English - Date: 2016-06-03 18:01:36
22Automated theorem proving / Model theory / Formal methods / Constraint programming / Resolution / Skolem normal form / Lambda calculus / Satisfiability / Boolean satisfiability problem / Conjunctive normal form

¨ DES SAARLANDES UNIVERSITAT FR 6.2 – Informatik Christoph Weidenbach Lecture “Automated Reasoning”

Add to Reading List

Source URL: resources.mpi-inf.mpg.de

Language: English - Date: 2010-08-07 06:03:33
23Automated theorem proving / Logic in computer science / Boolean algebra / Electronic design automation / Formal methods / Craig interpolation / Boolean satisfiability problem / Unit propagation / Resolution / Interpolation / Propositional calculus / Satisfiability modulo theories

On interpolation in decision procedures⋆ Maria Paola Bonacina and Moa Johansson Dipartimento di Informatica, Universit` a degli Studi di Verona Strada Le Grazie 15, IVerona, Italy

Add to Reading List

Source URL: www.cse.chalmers.se

Language: English - Date: 2012-03-21 07:54:00
24Logic in computer science / Mathematical logic / Aachen / RWTH Aachen University / Termination analysis / Boolean satisfiability problem / NP-completeness / Algorithm / Rewriting

Aachen Department of Computer Science Technical Report SAT Encodings: From Constraint-Based Termination

Add to Reading List

Source URL: sunsite.informatik.rwth-aachen.de

Language: English - Date: 2012-10-02 11:28:08
25Logic in computer science / Automated theorem proving / Constraint programming / Boolean algebra / Propositional calculus / Unsatisfiable core / Boolean satisfiability problem / Resolution / Maximum satisfiability problem / Satisfiability / Package manager / Debian

sets-graph-msuc-opt.ipeps

Add to Reading List

Source URL: tmancini.di.uniroma1.it

Language: English - Date: 2008-12-16 11:04:43
26Logic programming / Automated theorem proving / Logic in computer science / Formal methods / Theoretical computer science / Unification / Lambda calculus / Boolean satisfiability problem / Conjunctive normal form

¨ DES SAARLANDES UNIVERSITAT FR 6.2 – Informatik Christoph Weidenbach Lecture “Automated Reasoning”

Add to Reading List

Source URL: resources.mpi-inf.mpg.de

Language: English - Date: 2013-08-19 07:46:27
27Boolean algebra / Formal methods / Theoretical computer science / Implicant / Disjunctive normal form / IP / Lambda calculus / Vector space / Boolean satisfiability problem / Bayesian network

RESEARCHCONTRIBUTIONS Artificial Intelligence and Language Processing

Add to Reading List

Source URL: aml.media.mit.edu

Language: English - Date: 2011-07-13 14:33:31
28Complexity classes / Computational complexity theory / Boolean algebra / Structural complexity theory / NP-complete problems / Boolean satisfiability problem / NP / PP / Reduction / True quantified Boolean formula / Exponential time hypothesis / P

Economics and Computation ECONand CPSCProfessor Dirk Bergemann and Professor Joan Feigenbaum Lecture IV

Add to Reading List

Source URL: zoo.cs.yale.edu

Language: English - Date: 2008-10-07 04:07:53
29Automated theorem proving / Logic in computer science / Constraint programming / Logic programming / Rules of inference / Resolution / Boolean satisfiability problem / Clause / Small clause / Reasoning system / English relative clauses / Unit propagation

System Description: iProver – An Instantiation-Based Theorem Prover for First-Order Logic Konstantin Korovin? The University of Manchester School of Computer Science

Add to Reading List

Source URL: www.cs.man.ac.uk

Language: English - Date: 2008-10-30 19:06:51
30Complexity classes / Computational complexity theory / Mathematical optimization / Analysis of algorithms / NP-complete problems / Smoothed analysis / IP / PP / NP / Time complexity / Average-case complexity / Boolean satisfiability problem

Smoothed Complexity Theory Markus Bl¨aser1 and Bodo Manthey2 1 Saarland University, 2

Add to Reading List

Source URL: www-cc.cs.uni-saarland.de

Language: English - Date: 2014-01-17 04:45:53
UPDATE